Relativizing relativized computations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relativizing the relativized a priori: Reichenbach's axioms of coordination divided

In recent years, Reichenbach’s 1920 conception of the principles of coordination has attracted increased attention after Michael Friedman’s attempt to revive Reichenbach’s idea of a “relativized a priori”. This paper follows the origin and development of this idea in the framework of Reichenbach’s distinction between the axioms of coordination and the axioms of connection. It suggests a further...

متن کامل

Relativizing Relativity

In what follows, we shall study two signal types with two different signal velocities generating two different sets of Lorentz frames associated with two types of ``light'' cones. (A generalization to an arbitrary number of signals is straightforward.) This may seem implausible and even misleading at first, since from two different ``maximal'' signal velocities only one can be truly maximal. On...

متن کامل

Relativized codes

A code C over an alphabet Σ is a set of words such that every word in C+ has a unique factorization over C, that is, a unique C-decoding. When not all words in C+ appear as messages, a weaker notion of unique factorization can be used. Thus we consider codes C relative to a given set of messages L, such that each word in L has a unique C-decoding. We extend this idea of relativizing code concep...

متن کامل

Relativizing Chaitin’s Halting Probability

As a natural example of a 1-random real, Chaitin proposed the halting probability Ω of a universal prefix-free machine. We can relativize this example by considering a universal prefix-free oracle machine U . Let ΩU be the halting probability of U A; this gives a natural uniform way of producing an A-random real for every A ∈ 2ω . It is this operator which is our primary object of study. We can...

متن کامل

Relativizing Function Classes

The operators min·, max·, and #· translate classes of the polynomial-time hierarchy to function classes. Although the inclusion relationships between these function classes have been studied in depth, some questions concerning separations remained open. We provide oracle constructions that answer most of these open questions in the relativized case. As a typical instance for the type of results...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1989

ISSN: 0304-3975

DOI: 10.1016/0304-3975(89)90164-3